Strong connections between quantum encodings, nonlocality, and quantum cryptography
نویسندگان
چکیده
منابع مشابه
Strong connections between quantum encodings, nonlocality, and quantum cryptography
Encoding information in quantum systems can offer surprising advantages but at the same time there are limitations that arise from the fact that measuring an observable may disturb the state of the quantum system. In our work, we provide an in-depth analysis of a simple question: What happens when we perform two measurements sequentially on the same quantum system? This question touches upon so...
متن کاملQuantum Nonlocality and Inseparability
wK = 1. A necessary condition for separability is derived and is shown to be more sensitive than Bell’s inequality for detecting quantum inseparability. Moreover, collective tests of Bell’s inequality (namely, tests that involve several composite systems simultaneously) may sometimes lead to a violation of Bell’s inequality, even if the latter is satisfied when each composite system is tested s...
متن کاملCombinatorics and quantum nonlocality.
We use techniques for lower bounds on communication to derive necessary conditions (in terms of detector efficiency or amount of superluminal communication) for being able to reproduce the quantum correlations occurring in Einstein-Podolsky-Rosen-type experiments with classical local hidden-variable theories. As an application, we consider n parties sharing a Greenberger-Horne-Zeilinger-type st...
متن کاملQuantum Computing and Quantum Cryptography
Entrust is a registered trademark of Entrust, Inc. in the United States and certain other countries. Entrust is a registered trademark of Entrust Limited in Canada. All other Entrust product names and service names are trademarks or registered trademarks of Entrust, Inc or Entrust Limited. All other company and product names are trademarks or registered trademarks of their respective owners.
متن کاملQuantum and Post Quantum Cryptography
Public key cryptography is widely used for signing contracts, electronic voting, encryption, and to secure transactions over the Internet. The discovery by Peter Shor, in 1994, of an efficient algorithm based on quantum mechanics for factoring large integers and computing discrete logarithms undermined the security assumptions upon which currently used public key cryptographic algorithms are ba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2014
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.89.022334